Test Data Compression Using Variable Prefix Run Length ( VPRL ) Code
نویسنده
چکیده
One of the major challenges in testing a system-on-a-chip (SoC) is dealing with the large test data volume and large scan power consumption. To reduce the volume of test data, several test data compression techniques have been proposed. This paper presents a new test data compression scheme, which reduces test data volume for a system-on-a-chip (SoC). The proposed approach is based on the use of MT (Minimum Transition)-fill technique and Variable Prefix Run Length (VPRL) codes for test data compression. These VPRL codes can efficiently compress the data streams, that are composed of both runs of 0s and 1s. Experimental results for ISCAS’89 benchmark circuits supports and proves the proposed approach, better to the other existing techniques, by reducing test data volume.
منابع مشابه
Test data compression for system-on-a-chip using extended frequency-directed run-length code
One of the major challenges in testing a System-on-a-Chip (SOC) is dealing with the large test data size. To reduce the volume of test data, several test data compression techniques have been proposed. Frequencydirected run-length (FDR) code is a variable-to-variable run length code based on encoding runs of 0’s. In this work, we demonstrate that higher test data compression can be achieved bas...
متن کاملExtended Frequency-Directed Run-Length Code with Improved Application to System-on-a-Chip Test Data Compression
One of the major challenges in testing a System-on-aChip (SOC) is dealing with the large test data size. To reduce the volume of test data, several test data compression techniques have been proposed. Frequencydirected run-length (FDR) code is a variable-to-variable run length code based on encoding runs of 0’s. In this work, we demonstrate that higher test data compression can be achieved base...
متن کاملA fast decoding method for prefix codes - Data Compression Conference, 2003. Proceedings. DCC 2003
Prefix codes exert a major role in well known compression schemes. They allow a text to be decoded without ambiguity, since they are variable-length codes where no codeword is a prefix of other. The problem of improving their decoding speed has received a special attention in the data compression community. Among the several techniques that have been proposed, Table Look-up is one of the most e...
متن کاملUsing an innovative coding algorithm for data encryption∗
This paper discusses the problem of using data compression for encryption. We first propose an algorithm for breaking a prefix-coded file by enumeration. Based on the algorithm, we respectively analyze the complexity of breaking Huffman codes and Shannon-Fano-Elias codes under the assumption that the cryptanalyst knows the code construction rule and the probability mass function of the source. ...
متن کاملRun-length Based Compression for Selective Unspecified Test Pattern
In all System-on-a-Chip (SoC) designs, there is a necessity to reduce the large test data volume and this is achieved by test data compression. One of the methods is the variable-to-variable length compression method. A selective run-length based compression which comes under variable-to-variable method is presented in this paper. The proposed work is based on threshold calculation on don’t car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014